Local and recognizable hexagonal picture languages
نویسندگان
چکیده
In this paper we introduce hexagonal Wang tiles, local hexagonal picture languages, and recognizable hexagonal picture languages. We use hexagonal Wang tiles to introduce hexagonal Wang systems(HWS), a formalism to recognize hexagonal picture languages. It is noticed that the family of hexagonal picture languages defined by hexagonal Wang systems coincides with the family of hexagonal picture languages recognized by hexagonal tiling system. Similar to hv-domino systems, we define xyz-domino systems and prove that recognizable picture languages are characterized as projections of xyz-local picture languages. We also consider hexagonal pictures over one letter alphabet.
منابع مشابه
Recognizable Picture Languages and Domino Tiling
In [2], Giammarresi and Restivo define the notion of local picture languages by giving a set of authorized 2 x 2 tiles over C U {#} where # is a boundary symbol which surrounds the pictures. Then they define the class of recognizable picture languages as the set of languages which can be obtained by projection of a local one. This class is of interest since it admits several quite different cha...
متن کاملAmbiguity and Complementation in Recognizable Two-dimensional Languages
The theory of one-dimensional (word) languages is well founded and investigated since fifties. From several years, the increasing interest for pattern recognition and image processing motivated the research on two-dimensional or picture languages, and nowadays this is a research field of great interest. A first attempt to formalize the concept of finite state recognizability for two-dimensional...
متن کاملA Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
The theory of one-dimensional (word) languages is well founded and investigated since fifties. From several years, the increasing interest for pattern recognition and image processing motivated the research on two-dimensional or picture languages, and nowadays this is a research field of great interest. A first attempt to formalize the concept of finite state recognizability for twodimensional ...
متن کاملOn Piecewise Testable, Starfree, and Recognizable Picture Languages
We isolate a technique for showing that a picture language (i.e. a \two-dimensional language") is not recognizable. Then we prove the non-recognizability of a picture language that is both starfree (i.e., deenable by means of union, concatenation, and complement) and piece-wise testable (i.e., deenable by means of allowed subpictures), solving an open question in GR96]. We also deene local, loc...
متن کاملA logical approach to locality in pictures languages
This paper deals with descriptive complexity of picture languages of any dimension by syntactical fragments of existential second-order logic. Two classical classes of picture languages are studied: The class of recognizable picture languages, i.e. projections of languages defined by local constraints (or tilings): it is known as the most robust class extending the class of regular languages to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJPRAI
دوره 19 شماره
صفحات -
تاریخ انتشار 2005